Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, x), y)), z) -> app2(app2(:, x), app2(app2(:, y), z))
app2(app2(:, app2(app2(+, x), y)), z) -> app2(app2(+, app2(app2(:, x), z)), app2(app2(:, y), z))
app2(app2(:, z), app2(app2(+, x), app2(f, y))) -> app2(app2(:, app2(app2(g, z), y)), app2(app2(+, x), a))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, x), y)), z) -> app2(app2(:, x), app2(app2(:, y), z))
app2(app2(:, app2(app2(+, x), y)), z) -> app2(app2(+, app2(app2(:, x), z)), app2(app2(:, y), z))
app2(app2(:, z), app2(app2(+, x), app2(f, y))) -> app2(app2(:, app2(app2(g, z), y)), app2(app2(+, x), a))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(app2(:, app2(app2(g, z), y)), app2(app2(+, x), a))
APP2(app2(:, app2(app2(:, x), y)), z) -> APP2(app2(:, y), z)
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(app2(+, app2(app2(:, x), z)), app2(app2(:, y), z))
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(app2(:, y), z)
APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(app2(g, z), y)
APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(app2(+, x), a)
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(+, app2(app2(:, x), z))
APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(:, app2(app2(g, z), y))
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(:, y)
APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(g, z)
APP2(app2(:, app2(app2(:, x), y)), z) -> APP2(app2(:, x), app2(app2(:, y), z))
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(app2(:, x), z)
APP2(app2(:, app2(app2(:, x), y)), z) -> APP2(:, y)
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(:, x)

The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, x), y)), z) -> app2(app2(:, x), app2(app2(:, y), z))
app2(app2(:, app2(app2(+, x), y)), z) -> app2(app2(+, app2(app2(:, x), z)), app2(app2(:, y), z))
app2(app2(:, z), app2(app2(+, x), app2(f, y))) -> app2(app2(:, app2(app2(g, z), y)), app2(app2(+, x), a))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(app2(:, app2(app2(g, z), y)), app2(app2(+, x), a))
APP2(app2(:, app2(app2(:, x), y)), z) -> APP2(app2(:, y), z)
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(app2(+, app2(app2(:, x), z)), app2(app2(:, y), z))
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(app2(:, y), z)
APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(app2(g, z), y)
APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(app2(+, x), a)
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(+, app2(app2(:, x), z))
APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(:, app2(app2(g, z), y))
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(:, y)
APP2(app2(:, z), app2(app2(+, x), app2(f, y))) -> APP2(g, z)
APP2(app2(:, app2(app2(:, x), y)), z) -> APP2(app2(:, x), app2(app2(:, y), z))
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(app2(:, x), z)
APP2(app2(:, app2(app2(:, x), y)), z) -> APP2(:, y)
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(:, x)

The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, x), y)), z) -> app2(app2(:, x), app2(app2(:, y), z))
app2(app2(:, app2(app2(+, x), y)), z) -> app2(app2(+, app2(app2(:, x), z)), app2(app2(:, y), z))
app2(app2(:, z), app2(app2(+, x), app2(f, y))) -> app2(app2(:, app2(app2(g, z), y)), app2(app2(+, x), a))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 10 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(:, app2(app2(:, x), y)), z) -> APP2(app2(:, x), app2(app2(:, y), z))
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(app2(:, x), z)
APP2(app2(:, app2(app2(:, x), y)), z) -> APP2(app2(:, y), z)
APP2(app2(:, app2(app2(+, x), y)), z) -> APP2(app2(:, y), z)

The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, x), y)), z) -> app2(app2(:, x), app2(app2(:, y), z))
app2(app2(:, app2(app2(+, x), y)), z) -> app2(app2(+, app2(app2(:, x), z)), app2(app2(:, y), z))
app2(app2(:, z), app2(app2(+, x), app2(f, y))) -> app2(app2(:, app2(app2(g, z), y)), app2(app2(+, x), a))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.